Finding approximate gene clusters with Gecko 3

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding approximate gene clusters with Gecko 3

Gene-order-based comparison of multiple genomes provides signals for functional analysis of genes and the evolutionary process of genome organization. Gene clusters are regions of co-localized genes on genomes of different species. The rapid increase in sequenced genomes necessitates bioinformatics tools for finding gene clusters in hundreds of genomes. Existing tools are often restricted to fe...

متن کامل

Algorithms for Finding Gene Clusters

Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permutations. Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We consider several problems related to common intervals in multiple g...

متن کامل

Finding electron affinities with approximate density functionals

There has been a long discussion about the reliability of approximate density functionals for atomic anions. It is well known that the extra electron produces a strong self-interaction error, so strong that the extra electron is unbound. Despite this, electron affinities have been calculated using finite basis sets and very good results have been reported by Schaefer and others. We recently sug...

متن کامل

Finding an Approximate Maximum

Suppose that there are n elements from a totally ordered domain. The objective is to find, in a minimum possible number of rounds, an element that belongs to the biggest n/2, where in each round one is allowed to ask n binary comparisons. It is shown that log* n +19(1) rounds are both necessary and sufficient in the best algorithm for this problem.

متن کامل

Finding Meaning of Clusters

Clustering is an important data exploration task in chance discovery as well as in data mining. The first hierarchical clustering dates back to 1951 by K. Florek; since then, there have been numerous algorithms. However, there is no consensus among researchers as to what constitutes a cluster; the choice of the cluster is application-dependent. Although clustering is sometimes evaluated by inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nucleic Acids Research

سال: 2016

ISSN: 0305-1048,1362-4962

DOI: 10.1093/nar/gkw843